A Computational Model for Generic Graph Functions
نویسندگان
چکیده
z Abstract The generic graph machine, a Turing machine-like computation model for generic graph functions, is introduced. A connguration of this machine consists of a number of machine instances that each are in a state and point to two nodes of a graph. During the execution of a step, the machine instances perform in parallel a local transformation on the graph and are each replaced by a number of other machine instances. It is proved that the generic graph machines express a large and natural class of generic graph functions.
منابع مشابه
Application of Graph Theory: Investigation of Relationship Between Boiling Temperatures of Olefins and Topological Indices
Abstract: In this study an appropriate computational approach was presented for estimating the boiling temperatures of 41 different types of olefins and their derivatives. Based on the guidelines of this approach, several structural indices related to the organic components were applied using graph theory. Meanwhile, in addition to evaluating the relation between the boiling temperatures of ole...
متن کاملGraph-based Visual Saliency Model using Background Color
Visual saliency is a cognitive psychology concept that makes some stimuli of a scene stand out relative to their neighbors and attract our attention. Computing visual saliency is a topic of recent interest. Here, we propose a graph-based method for saliency detection, which contains three stages: pre-processing, initial saliency detection and final saliency detection. The initial saliency map i...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملMathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method
This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...
متن کاملA model for specification, composition and verification of access control policies and its application to web services
Despite significant advances in the access control domain, requirements of new computational environments like web services still raise new challenges. Lack of appropriate method for specification of access control policies (ACPs), composition, verification and analysis of them have all made the access control in the composition of web services a complicated problem. In this paper, a new indepe...
متن کامل